Uncheatable Distributed Computations

Searching for High-Value Rare Events with Uncheatable Grid Computing

High-value rare-event searching is arguably the most natural application of grid computing, where computational tasks are distributed to a large collection of clients (which comprise the computation grid) in such a way that clients are rewarded for performing tasks assigned to them. Although natural, rare-event searching presents significant challenges for a computation supervisor, who partitio...

The Design of Uncheatable Benchmarks

Distributing Frequency-Dependent Data Stream Computations

Data stream computations in domains such as internet applications are often performed in a highly distributed fashion in order to save time. An example is the class of applications that use the Google Mapreduce framework of scalable distributed processing as presented by (Dean & Ghemawat 2004). A basic question here is: what kind of data stream computations admit scalable and efficient distribu...

Privacy Preserving and Incentive Compatible Protocols for Cooperation in Distributed Computations

PRIVACY PRESERVING AND INCENTIVE COMPATIBLE PROTOCOLS FOR COOPERATION IN DISTRIBUTED COMPUTATIONS

Universal Constructs in Distributed Computations

This paper presents two classes of universal constructs that occur in distributed computations and explores their properties. It first examines a pair of universal constructs termed IO and OI intervals that occur at nodes in distributed computations. These universal constructs are used as building blocks to design two global universal constructs, termed segments and paths, that occur across nod...